Abstraction for Crash-Resilient Objects

نویسندگان

چکیده

Abstract We study abstraction for crash-resilient concurrent objects using non-volatile memory (NVM). develop a library-correctness criterion that is sound ensuring contextual refinement in this setting, thus allowing clients to reason about library behaviors terms of their abstract specifications, and developers verify implementations against the specifications abstracting away from particular client programs. As semantic foundation we employ recent NVM model, called Persistent Sequential Consistency, extend its language operational semantics with useful specification constructs. The proposed correctness accounts NVM-related interactions between code due explicit persist instructions, calling policies enforced by libraries. illustrate our approach on two simple persistent different prototypical durability guarantees. Our results provide first formal compositional reasoning under NVM.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Abstraction for Concurrent Objects

ion for Concurrent Objects Ivana Filipović, Peter O’Hearn, Noam Rinetzky1, Hongseok Yang Queen Mary University of London, UK

متن کامل

Crash Resilient Communication in Dynamic Networks

An end-to-end data delivery protocol for dynamic communication networks is presented. The protocol uses bounded sequence numbers and can tolerate both link failures and (intermediate) processor crashes. Previous bounded end-to-end protocols could not tolerate crashes. We present a self-stabilizing version of the algorithm that can recover from crashes of the sender and the receiver as well as o...

متن کامل

Crash Resilient and Pseudo-Stabilizing Atomic Registers

We propose a crash safe and pseudo-stabilizing algorithm for implementing an atomic memory abstraction in a message passing system. Our algorithm is particularly appealing for multi-core architectures where both processors and memory contents (including stale messages in transit) are prone to errors and faults. Our algorithm extends the classical fault-tolerant implementation of atomic memory t...

متن کامل

Decentralized Asynchronous Crash-Resilient Runtime Verification

Runtime Verification (RV) is a lightweight method for monitoring the formal specification of a system during its execution. It has recently been shown that a given state predicate can be monitored consistently by a set of crash-prone asynchronous distributed monitors, only if sufficiently many different verdicts can be emitted by each monitor. We revisit this impossibility result in the context...

متن کامل

Crash Resilient Communication in Dynamic Networks (Preliminary Version)

An end-to-end data delivery protocol for dynamic communication networks is presented. The protocol uses bounded sequence numbers and can tolerate both link failures and processor crashes. Previous bounded end-to-end protocols could not tolerate crashes. A reliable data link layer is not assumed; instead the protocol is designed to work on top of the \bare" network, consisting of nodes connected...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2022

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-030-99336-8_10